Derivational Complexity Is an Invariant Cost Model
نویسندگان
چکیده
We show that in the context of orthogonal term rewriting systems, derivational complexity is an invariant cost model, both in innermost and in outermost reduction. This has some interesting consequences for (asymptotic) complexity analysis, since many existing methodologies only guarantee bounded derivational complexity.
منابع مشابه
Uncurrying for Innermost Termination and Derivational Complexity
First-order applicative term rewriting systems provide a natural framework for modeling higher-order aspects. In earlier work we introduced an uncurrying transformation which is termination preserving and reflecting. In this paper we investigate how this transformation behaves for innermost termination and (innermost) derivational complexity. We prove that it reflects innermost termination and ...
متن کاملOn the Complexity of Plan Adaptation by Derivational Analogy in a Universal Classical Planning Framework
In this paper we present an algorithm called DerUCP, which can be regarded as a general model for plan adaptation using Derivational Analogy. Using DerUCP, we show that previous results on the complexity of plan adaptation do not apply to Derivational Analogy. We also show that Derivational Analogy can potentially produce exponential reductions in the size of the search space generated by a pla...
متن کاملDerivational Replay in an Universal Classical Planning Framework
The status of plan adaptation has been somewhat controversial in the AI-planning literature, due to a conflict between worst-case complexity analyses (which have led to pessimistic conclusions about the utility of plan adaptation) and empirical results (in which plan adaptation has performed significantly better than planning from scratch). This paper provides a step toward the resolution of th...
متن کاملThe Derivational Complexity Induced by the Dependency Pair Method
We study the derivational complexity induced by the dependency pair method, enhanced with standard refinements. We obtain upper bounds on the derivational complexity induced by the dependency pair method in terms of the derivational complexity of the base techniques employed. In particular we show that the derivational complexity induced by the dependency pair method based on some direct techni...
متن کاملDerivational Complexity of Knuth-Bendix Orders Revisited
We study the derivational complexity of rewrite systems R compatible with KBO, if the signature of R is in nite. We show that the known bounds on the derivation height are preserved, if R ful ls some mild conditions. This allows us to obtain bounds on the derivational height of non simply terminating TRSs. Furthermore, we re-establish the 2-recursive upper-bound on the derivational complexity o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009